Convexity-preserving Interpolation of Scattered Data
نویسندگان
چکیده
We describe a detailed computational procedure which, given data values at arbitrarily distributed points in the plane, determines if the data are convex and, if so, constructs a smooth convex surface that interpolates the data. The method consists of constructing a triangulation of the nodes (data abscissae) for which the triangle-based piecewise linear interpolant is convex, computing a set of nodal gradients for which there exists a convex Hermite interpolant, and constructing a smooth convex surface that interpolates the nodal values and gradients. The method involves two data-dependent triangulations along with a straight-line dual of each, and we describe some interesting relationships among them.
منابع مشابه
Convex Preserving Scattered Data
We use bivariate C 1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and suucient condition on Bernstein-B ezier polynomials, we set the convexity preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on t...
متن کاملConvexity - Preserving Scattered Data Interpolation 33 2 . 3 Convexity Conditions
This study deals with constructing a convexity-preserving bivariate C interpolants to scattered data whenever the original data are convex. Sufficient conditions on lower bound of Bézier points are derived in order to ensure that surfaces comprising cubic Bézier triangular patches are always convex and satisfy C continuity conditions. Initial gradients at the data sites are estimated and then m...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملConvexity preserving splines over triangulations
A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein–Bézier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.
متن کاملShape-preserving interpolation by splines using vector subdivision
We give a local convexity preserving interpolation scheme using parametric 2 C cubic splines with uniform knots produced by a vector subdivision scheme which simultaneously provides the function and its first and second order derivatives. This is also adapted to give a scheme which is both local convexity and local monotonicity preserving when the data values are strictly increasing in the x di...
متن کامل